On a Stackelberg Subset Sum Game

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Stackelberg Subset Sum Game

This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\subset N$, and a second player, the follower, selects a solution $A\subseteq N$ in order to utilize a bounded...

متن کامل

The Subset Sum game☆

In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its own items included in the knapsack. The solution is built as follows: Each agent, in turn, selects one...

متن کامل

A Stackelberg Game Theory Approach

In the Long Term Evolution-Advanced (LTE-A) system, Device-to-device (D2D) communication underlying cellular networks can bring some advantages such as high data rates, low delay, low power consumption by reusing frequency bands with cellular user equipments (UEs). While at the same time, inter-cell and intra-cell interference is inevitable. The D2D users and cellular UEs will compete or cooper...

متن کامل

Incentive Stackelberg Strategies for a Dynamic Game on Terrorism

This paper presents a dynamic game model of international terrorism. The time horizon is finite, about the size of one presidency, or infinite. Quantitative and qualitative analysis of incentive Stackelberg strategies for both decision-makers of the game (“The West” and “International Terror Organization”) allows statements about the possibilities and limitations of terror control interventions...

متن کامل

Multidimensional Subset Sum Problem

This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the basis matrix contained only one column with set elements and the sum. In this thesis we suggest having several data columns (thus introducing multidimensionality). This allows us to reduce the size o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2018

ISSN: 1571-0653

DOI: 10.1016/j.endm.2018.07.018